Penggunaan Governing Languange Clause dan Translation Clause pada Perjanjian Berbahasa Asing
نویسندگان
چکیده
منابع مشابه
Clause Restructuring for Statistical Machine Translation
We describe a method for incorporating syntactic information in statistical machine translation systems. The first step of the method is to parse the source language string that is being translated. The second step is to apply a series of transformations to the parse tree, effectively reordering the surface string on the source language side of the translation system. The goal of this step is t...
متن کاملLogic{based Genetic Programming with Deenite Clause Translation Grammars Logic{based Genetic Programming with Deenite Clause Translation Grammars
DCTG-GP is a genetic programming system that uses deenite clause translation grammars. A DCTG is a logical version of an attribute grammar that supports the deenition of context{free languages, and it allows semantic information associated with a language to be easily accomodated by the grammar. This is useful in genetic programming for deening the interpreter of a target language, or incorpora...
متن کاملClause Types
There are at least four senses in which one can talk about clause or sentence types in a language. One way is in terms of the distinction between declarative, interrogative, and imperative sentences. This distinction, really one of sentence type, is discussed elsewhere in this anthology, in Chapter I.5 on Speech Act Distinctions in Syntax. A second sense of clause type is represented by the dis...
متن کاملRelative clause attachment ambiguity resolution in Persian
The present study seeks to find the way Persian native speakers resolve relative clause attachment ambiguities in sentences containing a complex NP of the type NP of NP followed by a relative clause (RC). Previous off-line studies have found a preference for high attachment in the present study, an on-line technique was used to help identify the nature of this process. Persian speakers were pre...
متن کاملLean clause-sets: generalizations of minimally unsatisfiable clause-sets
We study the problem of (eeciently) deleting such clauses from conjunctive normal forms (clause-sets) which can not contribute to any proof of unsatissability. For that purpose we introduce the notion of an autarky system, associated with a canonical normal form for every clause-set by deleting superruous clauses. Clause-sets where no clauses can be deleted are called lean, a natural generaliza...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Volksgeist: Jurnal Ilmu Hukum dan Konstitusi
سال: 2019
ISSN: 2615-5648,2615-174X
DOI: 10.24090/volksgeist.v2i1.2387